Search results for "Mathematics - Logic"

showing 10 items of 16 documents

Multisummability for generalized power series

2022

We develop multisummability, in the positive real direction, for generalized power series with natural support, and we prove o-minimality of the expansion of the real field by all multisums of these series. This resulting structure expands both $\mathbb{R}_{\mathcal{G}}$ and the reduct of $\mathbb{R}_{\mathrm{an}^*}$ generated by all convergent generalized power series with natural support; in particular, its expansion by the exponential function defines both the Gamma function on $(0,\infty)$ and the Zeta function on $(1,\infty)$.

Mathematics - Classical Analysis and ODEsGeneral MathematicsClassical Analysis and ODEs (math.CA)FOS: Mathematics[MATH] Mathematics [math]Mathematics - LogicLogic (math.LO)Primary 40C10 03C64 26E10 Secondary 30D60
researchProduct

Probabilistic inferences from conjoined to iterated conditionals

2017

Abstract There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P ( if A then B ) , is the conditional probability of B given A, P ( B | A ) . We identify a conditional which is such that P ( if A then B ) = P ( B | A ) with de Finetti's conditional event, B | A . An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. In this paper, we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as cond…

Indicative conditionalCounterfactual conditionalSettore MAT/06 - Probabilita' E Statistica MatematicaCompound conditionalInference02 engineering and technology050105 experimental psychologyTheoretical Computer ScienceArtificial Intelligence0202 electrical engineering electronic engineering information engineeringFOS: Mathematics0501 psychology and cognitive sciencesEvent (probability theory)Discrete mathematicsApplied Mathematics05 social sciencesProbability (math.PR)Probabilistic logicConditional probabilityCoherence (philosophical gambling strategy)Mathematics - Logic03b48 60A99Settore MAT/01 - Logica MatematicaLogical biconditionalCenteringp-EntailmentIterated conditional020201 artificial intelligence & image processingCounterfactualLogic (math.LO)CoherenceSoftwareMathematics - Probability
researchProduct

The Syllogistic with Unity

2011

We extend the language of the classical syllogisms with the sentence-forms “At most 1 p is a q” and “More than 1 p is a q”. We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation relation is sound and complete, even when reductio ad absurdum is allowed.

logic and natural languageFOS: Computer and information sciencesPure mathematicsComputer Science - Logic in Computer Sciencecomputational complexityComputational complexity theoryComputational logicSyllogismMathematics - Logicproof theorysyllogismsDerivation relationLogic in Computer Science (cs.LO)Reductio ad absurdumPhilosophyPhilosophy of logicProof theoryCalculusFOS: MathematicsF.4.0Logic (math.LO)Finite setMathematics03B65
researchProduct

Generalized Logical Operations among Conditional Events

2018

We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of n conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals; in particular we examine the Frechet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction $\mathcal…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaComputer Science - Artificial IntelligenceComputer scienceMonotonic functionProbabilistic reasoning02 engineering and technologyCommutative Algebra (math.AC)Conditional random quantitieFréchet-Hoeffding boundCoherent extensionNegationArtificial IntelligenceQuasi conjunction0202 electrical engineering electronic engineering information engineeringFOS: MathematicsCoherent prevision assessmentConditional eventNon-monotonic logicRule of inferenceCommutative propertyAssociative propertyDiscrete mathematicsProbability (math.PR)Probabilistic logicOrder (ring theory)ConjunctionMathematics - LogicCoherence (philosophical gambling strategy)p-entailmentProbabilistic inferenceMathematics - Commutative AlgebraConjunction (grammar)Artificial Intelligence (cs.AI)020201 artificial intelligence & image processingInference ruleNegationLogic (math.LO)Mathematics - ProbabilityDisjunction
researchProduct

Compound conditionals as random quantities and Boolean algebras

2022

Conditionals play a key role in different areas of logic and probabilistic reasoning, and they have been studied and formalised from different angles. In this paper we focus on the de Finetti's notion of conditional as a three-valued object, with betting-based semantics, and its related approach as random quantity as mainly developed by two of the authors. Compound conditionals have been studied in the literature, but not in full generality. In this paper we provide a natural procedure to explicitly attach conditional random quantities to arbitrary compound conditionals that also allows us to compute their previsions. By studying the properties of these random quantities, we show that, in f…

03B48Settore MAT/06 - Probabilita' E Statistica MatematicaFOS: MathematicsMathematics - LogicLogic (math.LO)Compound conditionals Conditional Boolean algebra conjunction and disjunction canonical extension
researchProduct

On two topological cardinal invariants of an order-theoretic flavour

2012

Noetherian type and Noetherian $\pi$-type are two cardinal functions which were introduced by Peregudov in 1997, capturing some properties studied earlier by the Russian School. Their behavior has been shown to be akin to that of the \emph{cellularity}, that is the supremum of the sizes of pairwise disjoint non-empty open sets in a topological space. Building on that analogy, we study the Noetherian $\pi$-type of $\kappa$-Suslin Lines, and we are able to determine it for every $\kappa$ up to the first singular cardinal. We then prove a consequence of Chang's Conjecture for $\aleph_\omega$ regarding the Noetherian type of countably supported box products which generalizes a result of Lajos S…

NoetherianHigher Suslin LinePixley–Roy hyperspacePrimary: 03E04 54A25 Secondary: 03E35 54D70LogicOpen setMathematics::General TopologyDisjoint setsTopological spaceType (model theory)TopologyChangʼs ConjectureChangʼs Conjecture for ℵωFOS: MathematicsBox productMathematicsMathematics - General TopologyConjectureMathematics::Commutative AlgebraGeneral Topology (math.GN)PCF theoryNoetherian typeMathematics - LogicInfimum and supremumMathematics::LogicOIF spaceLogic (math.LO)
researchProduct

Probabilities of conditionals and previsions of iterated conditionals

2019

Abstract We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability to be the conditional probability. In our approach, however, we avoid triviality because the import-export principle is invalid. We then analyze an example of reasoning under partial knowledge where, given a conditional if A then C as information, the probability of A should intuitively increase. We explain this intuition by making some implicit background information explicit. We consider several (generalized) iterated conditionals, which allow…

Background informationSettore MAT/06 - Probabilita' E Statistica MatematicaInference02 engineering and technologyConditional probabilities and previsionTheoretical Computer ScienceConditional random quantitieAffirmation of the ConsequentArtificial Intelligence020204 information systemsFOS: Mathematics0202 electrical engineering electronic engineering information engineeringConjoined and iterated conditionalMathematicsIndependence and uncorrelation.Applied MathematicsProbability (math.PR)Conditional probabilityMathematics - LogicTrivialityIterated function020201 artificial intelligence & image processingLogic (math.LO)Mathematical economicsCoherenceSoftwareMathematics - ProbabilityIntuition
researchProduct

Noetherian type in topological products

2010

The cardinal invariant "Noetherian type" of a topological space $X$ (Nt(X)) was introduced by Peregudov in 1997 to deal with base properties that were studied by the Russian School as early as 1976. We study its behavior in products and box-products of topological spaces. We prove in Section 2: 1) There are spaces $X$ and $Y$ such that $Nt(X \times Y) < \min\{Nt(X), Nt(Y)\}$. 2) In several classes of compact spaces, the Noetherian type is preserved by the operations of forming a square and of passing to a dense subspace. The Noetherian type of the Cantor Cube of weight $\aleph_\omega$ with the countable box topology, $(2^{\aleph_\omega})_\delta$, is shown in Section 3 to be closely related …

Topological manifoldFundamental groupTopological algebraGeneral MathematicsTopological tensor productGeneral Topology (math.GN)Noetherian typeMathematics::General TopologyMathematics - LogicTopological spaceChang’s conjectureTopologyTopological vector spaceTukey mapH-spaceMathematics::LogicFOS: MathematicsPCF theoryTopological ring03E04 54A25 (Primary) 03E55 54B10 54D70 54G10 (Secondary)Box productLogic (math.LO)Mathematics - General TopologyMathematics
researchProduct

Probabilistic entailment and iterated conditionals

2018

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval $[0,1]$. We examine the iterated conditional $(B|K)|(A|H)$, by showing that $A|H$ p-entails $B|K$ if and only if $(B|K)|(A|H) = 1$. Then, we show that a p-consistent family $\mathcal{F}=\{E_1|H_1,E_2|H_2\}$ p-entails a conditional event $E_3|H_3$ if and only if $E_3|H_3=1$, or $(E_3|H_3)|QC(\mathcal{S})=1$ for some nonempty subset $\mathcal{S}$ of $\mathcal{F}$, where $QC(\mathcal{S})$ is the quasi conjunction of the conditional events in $\mathcal{S}$. Then, we examine the inference rules $A…

Probability (math.PR)FOS: MathematicsMathematics - LogicLogic (math.LO)Mathematics - Probability
researchProduct

Inductive types in homotopy type theory

2012

Homotopy type theory is an interpretation of Martin-L\"of's constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigates inductive types in this setting. Modified rules for inductive types, including types of well-founded trees, or W-types, are presented, and the basic homotopical semantics of such types are determined. Proofs of all results have been formally verified by the Coq proof assistant, and the proof s…

FOS: Computer and information sciencesComputer Science - Logic in Computer Science03B15 03B70 03F500102 computer and information sciences01 natural sciencesComputer Science::Logic in Computer ScienceFOS: MathematicsA¹ homotopy theoryCategory Theory (math.CT)0101 mathematicsMathematicsHomotopy lifting propertyType theory inductive types homotopy-initial algebraHomotopy010102 general mathematicsMathematics - Category TheoryIntuitionistic type theoryMathematics - LogicSettore MAT/01 - Logica MatematicaLogic in Computer Science (cs.LO)Algebran-connectedType theoryTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematicsProof theoryTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSHomotopy type theoryComputer Science::Programming LanguagesLogic (math.LO)
researchProduct